Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
301	On the Expected Depth of Random Circuits Sunil Arya∗ Mordecai J. Golin† Kurt Mehlhorn‡ Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 05:20:19 Complexity classes Markov processes Markov chain NC AC Circuit Arithmetic circuit complexity Μ operator Theoretical computer science Applied mathematics Circuit complexity
302	Statistical parsing inference: The General Problem Seven Lectures on Statistical Parsing • Someone gives you a PCFG G • For any given sentence, you might want to: Add to Reading List Source URL: nlp.stanford.edu Language: English - Date: 2007-08-06 23:23:06 Science Theoretical computer science Computational linguistics Bioinformatics Stochastic context-free grammar Bottom-up parsing Complexity classes Parsing Parse tree Linguistics Statistical natural language processing Formal languages
303	TITLE: TWO NEW MEASURES FOR ASSESSING COMPLEXITY AS INTERRELATEDNESS AUTHORS: DIAS, JOAO ; AMARAL, JOAO; LOPES, JOAO EMAIL: Add to Reading List Source URL: www.iioa.org Language: English - Date: 2009-10-17 09:31:20 Complexity Holism Transdisciplinarity L Science Structure Ethology Complex systems theory Complexity classes Abstraction
304	Some Minesweeper Configurations Richard Kaye School of Mathematics The University of Birmingham Birmingham B15 2TT Add to Reading List Source URL: web.mat.bham.ac.uk Language: English - Date: 2007-05-31 06:58:26 Mathematical optimization Conjectures P versus NP problem Structural complexity theory NP-complete Vehicle Identification Number Minesweeper P-complete NP Theoretical computer science Complexity classes Applied mathematics
305	k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-10-14 03:31:39 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Clique problem Vertex cover Path decomposition Theoretical computer science Computational complexity theory Applied mathematics
306	Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2014-04-01 09:13:02 Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics
307	BD-NPC-4.0-PROCFLOWS-001 The Number Portability Administration System Number Porting Processes Change History Issue 6, July, 2008 Add to Reading List Source URL: www.numeris.lt Language: English - Date: 2008-07-16 09:13:30 IP Complexity classes Applied mathematics NP
308	A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-04-02 14:14:13 Circuit complexity Computational complexity theory ACC0 FO Comparator Sorting network AC TC0 Boolean circuit Theoretical computer science Applied mathematics Complexity classes
309	LSA 354: Statistical Parsing: Problem Set [Some of these problems are borrowed with thanks from Michael Collins and Regina Barzilay.] Question 1 Let’s use a very simple grammar (where S is the start symbol, and termina Add to Reading List Source URL: nlp.stanford.edu Language: English - Date: 2007-07-10 03:17:11 Theoretical computer science Compiler construction Programming language implementation Bioinformatics Stochastic context-free grammar Complexity classes Left corner Parse tree Parsing Formal languages Linguistics Statistical natural language processing
310	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics

UPDATE